int* shuffle(int* nums, int numsSize, int n, int* returnSize) {
	int* ans = malloc(2 * n * sizeof(int));
	int i = 0;
	int j = 0;
	for (i = 0; i < n; i++) {
		ans[i * 2] = nums[i];
		ans[i * 2 + 1] = nums[n + i];
	}
	*returnSize = 2 * n;
	return ans;
}
